Nonlocal Means With Dimensionality Reduction and SURE-Based Parameter Selection
نویسندگان
چکیده
منابع مشابه
Aided parameter selection for dimensionality reduction Project proposal
In this paper, a tool is evaluated to help users find optimal low-dimensional embeddings of highdimensional datasets. Two datasets are analysed using this tool. One is the well known COIL-20 dataset, the other is new dataset containing milkproduction data of an Automatic Milking System. We propose a tool that allows easy selection of dimensionality reduction algorithm, parameters and resulting ...
متن کاملCombining Unsupervised Variable Selection with Dimensionality Reduction
This paper bridges the gap between variable selection methods (e.g Pearson coefficients, KS test) and dimensionality reduction algorithms (e.g PCA, LDA). Variable selection algorithms encounter difficulties dealing with highly correlated data, as many features are similar in quality. Dimensionality reduction algorithms tend to combine all variables, and are not able to select significant variab...
متن کاملImproved Non-Local Means Algorithm Based on Dimensionality Reduction
Non-Local Means is an image denoising algorithm based on patch similarity. It compares a reference patch with the neighboring patches to find similar patches. Such similar patches participate in the weighted averaging process. Most of the computational time for Non-Local Means is consumed to measure patch similarity. In this thesis, we have proposed an improvement where the image patches are pr...
متن کاملArtifact reduction for separable nonlocal means
It was recently demonstrated [J. Electron. Imaging, 25(2), 2016] that one can perform fast non-local means (NLM) denoising of one-dimensional signals using a method called lifting. The cost of lifting is independent of the patch length, which dramatically reduces the run-time for large patches. Unfortunately, it is difficult to directly extend lifting for non-local means denoising of images. To...
متن کاملDimensionality Reduction for k-Means Clustering
In this thesis we study dimensionality reduction techniques for approximate k-means clustering. Given a large dataset, we consider how to quickly compress to a smaller dataset (a sketch), such that solving the k-means clustering problem on the sketch will give an approximately optimal solution on the original dataset. First, we provide an exposition of technical results of [CEM15], which show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 2011
ISSN: 1057-7149,1941-0042
DOI: 10.1109/tip.2011.2121083